Witnessing Genuine Multiphoton Indistinguishability

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Indistinguishability Amplification

A random system is the abstraction of the input-output behavior of any kind of discrete system, in particular cryptographic systems. Many aspects of cryptographic security analyses and proofs can be seen as the proof that a certain random system (e.g. a block cipher) is indistinguishable from an ideal system (e.g. a random permutation), for different types of distinguishers. This paper presents...

متن کامل

Genuine versus Non-Genuine Atomic Multicast Protocols

In this paper, we study atomic multicast, a fundamental abstraction for building fault-tolerant systems. We suppose a system composed of data centers, or groups, that host many processes connected through high-end local links; a few groups exist, interconnected through high-latency communication links. In this context, a recent paper has shown that no multicast protocol can deliver messages add...

متن کامل

Witnessing Network Transformations

Software-defined networking (SDN) is transforming the way networks are managed, as fixed distributed protocols give way to flexible route calculation software. The shift brings to the forefront the issue of software errors, which may produce wrong routes, and cause significant network disruption. We propose a run-time certification mechanism that rejects any wrongly calculated route before it i...

متن کامل

on distinguishability versus indistinguishability

The following comments are from the book Quantum Mechanics by Claude CohenTannoudji, Bernard Diu, and Franck Laloë. Identical particles: definition Two particles are said to be identical if all their intrinsic properties (mass, spin, charge, etc.) are exactly the same: no experiment can distinguish one from the other. Thus, all electrons in the universe are identical, as are all the protons and...

متن کامل

Approximate Bounded Indistinguishability

Two distributions over n-bit strings are (k, δ)-wise indistinguishable if no statistical test that observes k of the n bits can tell the two distributions apart with advantage better than δ. Motivated by secret sharing and cryptographic leakage resilience, we study the existence of pairs of distributions that are (k, δ)-wise indistinguishable, but can be distinguished by some function f of suit...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Physical Review Letters

سال: 2019

ISSN: 0031-9007,1079-7114

DOI: 10.1103/physrevlett.122.063602